FFT-like Multiplication of Linear Differential Operators

Composition Operators and Multiplication Operators on Orlicz Spaces

This article has no abstract.

Fast Polynomials Multiplication Using FFT

Shannon wavelet approximations of linear differential operators

Recent works emphasized the interest of numerical solution of PDE’s with wavelets. In their works [3, 4], A. Cohen, W. Dahmen and R. DeVore focussed on the non linear approximation aspect of the wavelet approximation of PDE’s to prove the relevance of such methods. In order to extend these results, we focuss on the convergence of the iterative algorithm, and we consider different possibilities ...

Complex Multiplication Reduction in Fft Processors

The number of multiplications has been used as a key metrics for comparing FFT algorithms since it has a large impact on the execution time and total power consumption. In this paper, we present a 16-point FFT Butterfly PE, which reduces the multiplicative complexity by using real, constant multiplications. A 1024-point FFT processor has been implemented using 16-point and 4-point Butterfly PEs...

Linear Differential Operators for Polynomial Equations

The results of this paper spring from the elementary fact that an algebraic function satisfies a linear differential equation. Let k0 be a number field and k0 be its algebraic closure. Let P ∈ k0(x)[y] be a squarefree polynomial of degree n in y. The derivation δ = d dx extends uniquely to the algebraic closure k0(x) of k0(x). We define the minimal operator associated with P to be the monic dif...